Satis ability Modulo Theories
نویسنده
چکیده
منابع مشابه
Satis ability Modulo Structures as Constraint Satisfaction: An Introduction
Constraint Programming (CP) and Satis ability Modulo Theories (SMT) both generalize SAT w.r.t. expressiveness and propagation power. CP uses domain propagators based on mathematical structures, whereas SMT uses constraint propagators based on logical theories. In this paper, we incorporate SMT reasoning into CP and illustrate the bene ts of the resulting system for the problem of rule veri cation.
متن کاملhaRVey: combining reasoners
We present the architecture of the oncoming version of the SMT (Satis ability Modulo Theories) solver haRVey [5]. haRVey checks the satis ability of a formula written in a rst-order language with interpreted symbols from various theories. Its new architecture is original, rst in the sense that it is a combination of reasoners, rather than the traditional combination of decision procedures. Seco...
متن کاملHow to Optimize the Use of SAT and SMT Solvers for Test Generation of Boolean Expressions
In the context of automatic test generation, the use of propositional satis ability (SAT) and Satis ability Modulo Theories (SMT) solvers is becoming an attractive alternative to traditional algorithmic test generation methods, especially when testing Boolean expressions. The main advantages are the capability to deal with constraints over the inputs, the generation of compact test suites, and ...
متن کاملNon-Disjoint Unions of Theories and Combinations of Satis ability Procedures: First Results
In this paper we outline a theoretical framework for the combination of decision procedures for the satis ability of constraints with respect to a constraint theory. We describe a general combination method which, given a procedure that decides constraint satis ability with respect to a constraint theory T1 and one that decides constraint satis ability with respect to a constraint theory T2, is...
متن کاملMatching Midlet's Security Claims with a Platform Security Policy using Automata Modulo Theory
Model-carrying code and security-by-contract have proposed to augment mobile code with a claim on its security behavior that could be matched against a mobile platform policy before downloading the code. In this paper we show that it is possible to de ne very expressive policies | essentially with in nite cases | that can capture realistic scenarios (e.g. "only connections to urls starting with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007